A Condition Number Analysis of a Line-Surface Intersection Algorithm
نویسندگان
چکیده
منابع مشابه
A Condition Number Analysis of a Line-Surface Intersection Algorithm
We propose an algorithm based on Newton’s method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. The algorithm can operate on polynomials represented in any basis that satisfies a few conditions....
متن کاملA Condition Number Analysis of a Surface-Surface Intersection Algorithm
The problem of finding all intersections between two surfaces has many applications in computational geometry and computer-aided geometric design. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm uses a test based on the Kantorovich theorem to prevent the divergence or slow convergence problems normally associated with using unsuitable starting po...
متن کاملA ug 2 00 6 A Condition Number Analysis of a Line - Surface Intersection Algorithm ∗
We propose an algorithm based on Newton’s method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. Our analysis shows that the running time of the algorithm is bounded in terms of the condition num...
متن کاملN ov 2 00 7 A Condition Number Analysis of a Surface - Surface Intersection Algorithm ∗
The problem of finding all intersections between two surfaces has many applications in computational geometry and computer-aided geometric design. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm uses a test based on the Kantorovich theorem to prevent the divergence or slow convergence problems normally associated with using unsuitable starting po...
متن کاملA / 0 60 80 90 v 1 2 3 A ug 2 00 6 A Condition Number Analysis of a Line - Surface Intersection Algorithm ∗
We propose an algorithm based on Newton’s method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. Our analysis shows that the running time of the algorithm is bounded in terms of the condition num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2008
ISSN: 1064-8275,1095-7197
DOI: 10.1137/060668043